Some orthogonal matrices constructed by strong Kronecker multiplication
نویسندگان
چکیده
Strong Kronecker multiplication of two matrices is useful for constructing new orthogonal matrices from those known. These results are particularly important as they allow small matrices to be combined to form larger matrices, but of smaller order than the straight-forward Kronecker product would permit.
منابع مشابه
Orthogonal Arrays Constructed by Generalized Kronecker Product∗
In this paper, we propose a new general approach to construct asymmetrical orthogonal arrays, namely generalized Kronecker product. The operation is not usual Kronecker product in the theory of matrices, but it is interesting since the interaction of two columns of asymmetrical orthogonal arrays can be often written out by the generalized Kronecker product. As an application of the method, some...
متن کاملParallel Multiplication of a Vector by a Kronecker Product of Matrices (Part II)
The paper provides a generalization of our previous algorithm for the parallel multiplication of a vector by a Kronecker product of matrices. For any p, a factor of the problem size, our algorithm runs on p processors with a minimum number of communication steps and memory space. Specifically, on p processors with global communication, we show that the multiplication requires at least Θ(log(p))...
متن کاملFurther results on ternary complementary sequences, orthogonal designs and weighing matrices
A set of sequences is complementary, if the sum of their periodic or nonperiodic autocorrelation function is zero. Infinite families of orthogonal designs, based on some weighing matrices of order 2n, weight 2n− k and spread σ, are constructed from two circulants matrices by using complementary sequences of zero non-periodic autocorrelation function, i.e. ternary complementary pairs. Moreover, ...
متن کاملNew Approach To A Class Of Matrices
The displacement structure is extended to a Kronecker matrix W ⊗ Z. A new class of Kronecker-like matrices with the displacement rank r, r < n will be formulated and presented. The computational complexity of multiplication with vectors for Kronecker-like matrices has been accelerated. Applying the displacement, which was originally discovered by Kailath, Kung and Morf [15], a new superfast alg...
متن کاملComplexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models
We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 7 شماره
صفحات -
تاریخ انتشار 1993